Computing interpolants in implicational logics
نویسندگان
چکیده
منابع مشابه
Computing interpolants in implicational logics
I present a new syntactical method for proving the Interpolation Theorem for the implicational fragment of intuitionistic logic and its substructural subsystems. This method, like Prawitz’s, works on natural deductions rather than sequent derivations, and, unlike existing methods, always finds a ‘strongest’ interpolant under a certain restricted but reasonable notion of what counts as an ‘inter...
متن کاملImplicational F-Structures and Implicational Relevance Logics
We describe a method for obtaining classical logic from intuitionistic logic which does not depend on any proof system, and show that by applying it to the most important implicational relevance logics we get relevance logics with nice semantical and proof-theoretical properties. Semantically all these logics are sound and strongly complete relative to classes of structures in which all element...
متن کاملAn Abstract Approach to Fuzzy Logics: implicational semilinear logics
This paper presents a new abstract framework to deal in a uniform way with the increasing variety of fuzzy logics studied in the literature. By means of notions and techniques from Abstract Algebraic Logic, we perform a study of non-classical logics based on the kind of generalized implication connectives they possess. It yields the new hierarchy of implicational logics. In this framework the n...
متن کاملImplicational (semilinear) logics I: a new hierarchy
In Abstract Algebraic Logic, the general study of propositional non-classical logics has been traditionally based on the abstraction of the Lindenbaum-Tarski process. In this process one considers the Leibniz relation of indiscernible formulae. Such approach has resulted in a classification of logics partly based on generalizations of equivalence connectives: the Leibniz hierarchy. This paper p...
متن کاملComputing Interpolants without Proofs
We describe an incremental algorithm for computing interpolants for a pair φA, φB of formulas in propositional logic. In contrast with the common approaches, our method does not require a proof of unsatisfiability of φA ∧ φB , and can be realized using any SAT solver as a black box. We achieve this by combining model enumeration with the ability to easily generate interpolants in the special ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2006
ISSN: 0168-0072
DOI: 10.1016/j.apal.2005.12.014